%0 Conference Proceedings
%4 sid.inpe.br/banon/2004/08.12.13.41
%2 sid.inpe.br/banon/2004/08.12.13.41.18
%@doi 10.1109/SIBGRA.2004.1352948
%T Postal Envelope Address Block Location by Fractal-Based Approach
%D 2004
%A Eiterer, Luiz Felipe,
%A Facon, Jacques,
%A Menotti, David,
%@affiliation PUCPR-Pontifícia Universidade Católica do Paraná
%@affiliation Rua Imaculada Conceição 1155, Prado Velho,
%@affiliation 80215-901 Curitiba-PR, Brazil,
%E Araújo, Arnaldo de Albuquerque,
%E Comba, João Luiz Dihl,
%E Navazo, Isabel,
%E Sousa, Antônio Augusto de,
%B Brazilian Symposium on Computer Graphics and Image Processing, 17 (SIBGRAPI) - Ibero-American Symposium on Computer Graphics, 2 (SIACG)
%C Curitiba, PR, Brazil
%8 17-20 Oct. 2004
%I IEEE Computer Society
%J Los Alamitos
%S Proceedings
%K segmentation, address block, fractal, Kmeans.
%X In this paper, we propose an approach based on fractal dimension to automatically locate address blocks in postal envelopes. First, the fractal dimension of each pixel of a postal envelope image is computed using the 2D variation procedure. The K-means clustering technique is then used to label pixels as background, noise and semantic objects like stamps, postmarks, and address blocks. A database composed of $200$ postal envelope images, with no fixed position for the address block, postmark and stamp is used to evaluate the efficiency of the proposed approach. For each envelope image, the ideal result (ground-truth segmentation) regarding each class has been generated. The comparison between the ground-truth segmentation and the results obtained through the proposed methodology is carried out pixel by pixel. Experiments showed significant and promising results. By using the 2D variation procedure for three ranges of neighbor window sizes (r= {3,5}, r= {3,5,7}, and r= {3,5,7,9}), the proposed approach reached a success rate over than 90% on average.
%@language en
%3 4388_Facon_J.pdf